Extracting Subregular constraints from Regular stringsets
نویسندگان
چکیده
منابع مشابه
Extracting Forbidden Factors from Regular Stringsets
The work presented here continues a program of completely characterizing the constraints on the distribution of stress in human languages that are documented in the StressTyp2 database with respect to the Local and Piecewise sub-regular hierarchies. We introduce algorithms that, given a Finite-State Automaton, compute a set of forbidden words, units, initial factors, free factors and final fact...
متن کاملAural Pattern Recognition Experiments and the Subregular Hierarchy
We explore the formal foundations of recent studies comparing aural pattern recognition capabilities of populations of human and non-human animals. To date, these experiments have focused on the boundary between the Regular and Context-Free stringsets. We argue that experiments directed at distinguishing capabilities with respect to the Subregular Hierarchy, which subdivides the class of Regula...
متن کاملMatching with Regular Constraints
We describe a matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. Context and sequence variables allow matching to move in term trees to arbitrary depth and breadth, respectively. The values of variables can be constrained by regular expressions which are not necessarily linear. We prove soundness, termination, and c...
متن کاملPropagating Regular Counting Constraints
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. This led to general modelling techniques and generic propagators, often based on deterministic finite automata (DFA) and their extensions. We consider counter-DFAs (cDFA), which provide concise models for regular counting constraints, that is constraints over the number of times a regular-language patte...
متن کاملExtracting State Constraints from PDDL-like Planning Domains
We describe a new method for inferring state constraints from PDDL-style planning problems. Planning systems can use state constraints as valuable domain-dependent knowledge to cut the search space and to speed up planning. A large and important class of state constraints are c-constraints which are prevalent among the constraints inferred by current techniques. These techniques are restricted ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Language Modelling
سال: 2019
ISSN: 2299-8470,2299-856X
DOI: 10.15398/jlm.v7i2.209